Helly-type theorems and Generalized Linear Programming
نویسندگان
چکیده
منابع مشابه
Helly-Type Theorems and Generalized Linear Programming
Recent combinatorial algorithms for linear programming can also be applied to certain non-linear problems. We call these Generalized Linear Programming, or GLP, problems. We connect this class to a collection of results from combinatorial geometry called Helly-type theorems. We show that there is a Helly-type theorem about the constraint set of every GLP problem. Given a family H of sets with a...
متن کاملTolerance in Helly-Type Theorems
In this paper we introduce the notion of tolerance in connection with Helly type theorems and prove, using the Erdős-Gallai theorem, that any Helly type theorem can be generalized by relaxing the assumptions and conclusion, allowing a bounded number of exceptional sets or points. In particular, we analyze some of the classical Helly type theorems, such as Caratheodory’s and Tverberg’s theorems,...
متن کامل4 Helly - Type Theorems and Geometric
INTRODUCTION Let F be a family of convex sets in R. A geometric transversal is an affine subspace that intersects every member of F . More specifically, for a given integer 0 ≤ k < d, a k-dimensional affine subspace that intersects every member of F is called a ktransversal to F . Typically, we are interested in necessary and sufficient conditions that guarantee the existence of a k-transversal...
متن کامل4 Helly-type Theorems and Geometric Transversals
INTRODUCTION Let F be a family of convex sets in R. A geometric transversal is an affine subspace that intersects every member of F . More specifically, for a given integer 0 ≤ k < d, a k-dimensional affine subspace that intersects every member of F is called a ktransversal to F . Typically, we are interested in necessary and sufficient conditions that guarantee the existence of a k-transversal...
متن کاملDiscrete and Lexicographic Helly-Type Theorems
Helly’s theorem says that if every d + 1 elements of a given finite set of convex objects in R have a common point, then there is a point common to all of the objects in the set. We define three new types of Helly theorems: discrete Helly theorems—where the common point should belong to an a-priori given set, lexicographic Helly theorems—where the common point should not be lexicographically gr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete & Computational Geometry
سال: 1994
ISSN: 0179-5376,1432-0444
DOI: 10.1007/bf02574379